A formula for the number of tilings of an octagon by rhombi
نویسندگان
چکیده
We propose the first algebraic determinantal formula to enumerate tilings of a centro-symmetric octagon of any size by rhombi. This result uses the Gessel-Viennot technique and generalizes to any octagon a formula given by Elnitsky in a special case.
منابع مشابه
Enumeration of octagonal random tilings by the Gessel-Viennot method
We propose the first algebraic determinantal formula to enumerate random rhombus tilings filling a centro-symmetric octagon of any size. This result uses the GesselViennot technique and generalizes to any octagon a former specialized formula by Elnitsky.
متن کاملEnumeration of Hybrid Domino-Lozenge Tilings II: Quasi-Octagonal Regions
We use the subgraph replacement method to prove a simple product formula for the tilings of an octagonal counterpart of Propp’s quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999), called quasi-octagon.
متن کاملEnumeration of Lozenge Tilings of Punctured Hexagons
We present a combinatorial solution to the problem of determining the number of lozenge tilings of a hexagon with sides a, b + 1, b, a + 1, b, b + 1, with the central unit triangle removed. For a = b, this settles an open problem posed by Propp 7]. Let a, b, c be positive integers, and denote by H the hexagon whose side-lengths are (in cyclic order) a, b, c, a, b, c and all whose angles have 12...
متن کاملEnumeration of octagonal tilings
Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of the number of distinct tilings to the number of constituent tiles. Tilings by squares and 45 rhombi receive special attention as presumably the simplest mode...
متن کاملDomino tilings with diagonal impurities
This paper studies the dimer model on the dual graph of the square-octagon lattice, which can be viewed as the domino tilings with impurities in some sense. In particular, under a certain boundary condition, we give an exact formula representing the probability of finding an impurity at a given site in a uniformly random dimer configuration in terms of simple random walks on the square lattice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 319 شماره
صفحات -
تاریخ انتشار 2004